A Sequential Marginal Likelihood Approximation Using Stochastic Gradients
نویسندگان
چکیده
منابع مشابه
Asymptotic Approximation of Marginal Likelihood Integrals
We study the asymptotics of marginal likelihood integrals for discrete models using resolution of singularities from algebraic geometry, a method introduced recently by Sumio Watanabe. We briefly describe the statistical and mathematical foundations of this method, and explore how Newton diagrams and toric modifications help solve the problem. The approximations are then compared with exact com...
متن کاملPhylogenetic tree construction using sequential stochastic approximation Monte Carlo
Monte Carlo methods have received much attention recently in the literature of phylogenetic tree construction. However, they often suffer from two difficulties, the curse of dimensionality and the local-trap problem. The former one is due to that the number of possible phylogenetic trees increases at a super-exponential rate as the number of taxa increases. The latter one is due to that the phy...
متن کاملAutomatic Approximation of the Marginal Likelihood in Nonlinear Hierarchical Models
We show that the fitting of nonlinear hierarchical random effects models by maximum likelihood can be made automatic to the same extent that Bayesian model fitting can be automated by the program BUGS. The word ‘automatic’ here means that the technical details of computation are made transparent to the user. We achieve this by combining a technique from computer science known as ‘automatic diff...
متن کاملApproximating the marginal likelihood using copula
Model selection is an important activity in modern data analysis and the conventional Bayesian approach to this problem involves calculation of marginal likelihoods for different models, together with diagnostics which examine specific aspects of model fit. Calculating the marginal likelihood is a difficult computational problem. Our article proposes some extensions of the Laplace approximation...
متن کاملCombining Conjugate Direction Methods with Stochastic Approximation of Gradients
The method of conjugate directions provides a very effective way to optimize large, deterministic systems by gradient descent. In its standard form, however, it is not amenable to stochastic approximation of the gradient. Here we explore ideas from conjugate gradient in the stochastic (online) setting, using fast Hessian-gradient products to set up low-dimensional Krylov subspaces within indivi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings
سال: 2019
ISSN: 2504-3900
DOI: 10.3390/proceedings2019033018